Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles

نویسندگان

  • Ulrik Brandes
  • Sabine Cornelsen
  • Dorothea Wagner
چکیده

A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut is represented by a simple closed curve and vice versa. We show that the families of cuts that admit a drawing in which every cut is represented by an axis-parallel rectangle are exactly those that have a cactus model that can be rooted such that edges of the graph that cross a cycle of the cactus point to the root. This includes the family of all minimum cuts of a graph. The proof also yields an efficient algorithm to construct a drawing with axis-parallel rectangles if it exists.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Guillotine Cutting Sequences

Imagine a wooden plate with a set of non-overlapping geometric objects painted on it. How many of them can a carpenter cut out using a panel saw making guillotine cuts, i.e., only moving forward through the material along a straight line until it is split into two pieces? Already fifteen years ago, Pach and Tardos investigated whether one can always cut out a constant fraction if all objects ar...

متن کامل

On the union complexity of families of axis-parallel rectangles with a low packing number

Let R be a family of n axis-parallel rectangles with packing number p− 1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n + p), and that the (≤ k)-level complexity of R is at most O(kn+ kp). Both upper bounds are tight.

متن کامل

Near optimal-partitioning of rectangles and prisms

This paper focuses on the following problems: Problem 1 Given an axis parallel rectangle, how do you cut it in k equal area pieces such that the total length of the cuts is minimum? What are the properties of an optimal cut? Problem 2 Given an axis parallel prism, how do you cut it in k equal volume pieces such that the total surface area of the cuts is minimum? What are the properties of an op...

متن کامل

On Point Covers of Multiple Intervals and Axis-Parallel Rectangles

In certain families of hypergraphs the transversal number is bounded by some function of the packing number. In this paper we study hypergraphs related to multiple intervals and axis-parallel rectangles, respectively. Essential improvements of former established upper bounds are presented here. We explore the close connection between the two problems at issue.

متن کامل

Minimum Vertex Cover in Rectangle Graphs

We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families R where R1 \ R2 is connected for every pair of rectangles R1, R2 ∈ R. This algorithm extends to intersection graphs of pseudo-disks. The second algorithm achieves a factor of (1.5 + ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Graph Algorithms Appl.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2003